Method and apparatus for manipulating vectored data

ABSTRACT

A method and apparatus is disclosed for manipulating vectored data. The method includes shifting bits of packed data comprising M N-bit elements using a bit-level shift step followed by a byte-level shift step. A mask is generated and applied to the intermediate shifted result to produce the final result. A method is disclosed for conditionally transferring data from one general purpose register to another based on data in yet a third general purpose register.

CROSS-REFERENCES TO RELATED APPLICATIONS

This application is related to U.S. application Ser. No. 09/410,683, filed Oct. 1, 1999, entitled “AN INTEGER INSTRUCTION SET ARCHITECTURE AND IMPLEMENTATION,” and to U.S. application Ser. No. 09/410,599, filed Oct. 1, 1999 now abandoned, entitled “INSTRUCTIONS FOR MANIPULATING VECTORED DATA,” both of which are commonly owned by the Assignee of the present application, the contents of which are incorporated herein by reference.

BACKGROUND OF THE INVENTION

The present invention relates to microprocessors and more specifically to techniques for manipulating vectored data.

Increased computer processing is required to provide for modern digital services. As an example, the Internet has spawned a plethora of multimedia applications for presenting images and playing video and audio content. These applications involve the manipulation of complex data in the form of still graphic images and full motion video. It is commonly accepted that digitized images consume prodigious amounts of storage. For example, a single relatively modest-sized image having 480×640 pixels and a full-color resolution of 24 bits per pixel (three 8-bit bytes per pixel), occupies nearly a megabyte of data. At a resolution of 1024×768 pixels, a 24-bit color image requires 2.3 MB of memory to represent. A 24-bit color picture of an 8.5 inch by 11 inch page, at 300 dots per inch, requires as much as 2 MB of storage. Video images are even more data-intensive, since it is generally accepted that for high-quality consumer applications, images must occur at a rate of at least 30 frames per second. Current proposals for high-definition television (HDTV) call for as many as 1920×1035 or more pixels per frame, which translates to a data transmission rate of about 1.5 billion bits per second. Other advances in digital imaging and multimedia applications such as video teleconferencing and home entertainment systems have created an even greater demand for higher bandwidth and consequently ever greater processing capability.

Traditional lossless techniques for compressing digital image and video information include methods such as Huffman encoding, run length encoding and the Lempel-Ziv-Welch algorithm. These approaches, though advantageous in preserving image quality, are otherwise inadequate to meet the demands of high throughput systems. For this reason, compression techniques which typically involve.some loss of information have been devised. They include discrete cosine transform (DCT) techniques, adaptive DCT (ADCT) techniques, and wavelet transform techniques.

The Joint Photographic Experts Group (JPEG) has created a standard for still image compression, known as the JPEG standard. This standard defines an algorithm based on the discrete cosine transform (DCT). An encoder using the JPEG algorithm processes an image in four steps: linear transformation, quantization, run-length encoding (RLE), and Huffman coding. The decoder reverses these steps to reconstruct the image. For the linear transformation step, the image is divided up into blocks of 8×8 pixels and a DCT operation is applied in both spatial dimensions for each block. The purpose of dividing the image into blocks is to overcome a deficiency of the DCT algorithm, which is that the DCT is highly non-local. The image is divided into blocks in order to overcome this non-locality by confining it to small regions and doing separate transforms for each block. However, this compromise has the disadvantage of producing a tiled appearance which manifests itself visually by having a blockiness quality.

The quantization step is essential to reduce the amount of information to be transmitted, though it does cause loss of image information. Each transform component is quantized using a value selected from its position in each 8×8 block. This step has the convenient side effect of reducing the abundant small values to zero or other small numbers, which can require much less information to specify.

The run-length encoding step codes runs of same values, such as zeros, to produce codes which identify the number of times to repeat a value and the value to repeat. A single code like “8 zeros” requires less space to represent than a string of eight zeros, for example. This step is justified by the abundance of zeros that usually results from the quantization step.

Huffman coding (a popular form of entropy coding) translates each symbol from the run-length encoding step into a variable-length bit string that is chosen depending on how frequently the symbol occurs. That is, frequent symbols are coded with shorter codes than infrequent symbols. The coding can be done either from a preset table or one composed specifically for the image to minimize the total number of bits needed.

Similarly to JPEG, the Motion Pictures Experts Group (MPEG) has promulgated two standards for coding image sequences. The standards are known as MPEG I and MPEG II. The MPEG algorithms exploit the common occurrence of relatively small variations from frame to frame. In the MPEG standards, a full image is compressed and transmitted only once for every 12 frames. These “reference” frames (so-called “I-frames” for intra-frames) are typically compressed using JPEG compression. For the intermediate frames, a predicted frame (P-frame) is calculated and only the difference between the actual frame and each predicted frame is compressed and transmitted.

Any of several algorithms can be used to calculate a predicted frame. The algorithm is chosen on a block-by-block basis depending on which predictor algorithm works best for the particular block. One technique called “motion estimation” is used to reduce temporal redundancy. Temporal redundancy is observed in a movie where large portions of an image remain unchanged from frame to adjacent frame. In many situations, such as a camera pan, every pixel in an image will change from frame to frame, but nearly every pixel can be found in a previous image. The process of “finding” copies of pixels in previous (and future) frames is called motion estimation. Video compression standards such as H.261 and MPEG 1 & 2 allow the image encoder (image compression engine) to remove redundancy by specifying the motion of 16×16 pixel blocks within an image. The image being compressed is broken into blocks of 16×16 pixels. For each block in an image, a search is carried out to find matching blocks in other images that are in the sequence being compressed. Two measures are typically used to determine the match. One is the sum of absolute difference (SAD) which is mathematically written as ${\sum\limits_{i}\quad {\sum\limits_{j}\quad \left( {{a_{i} - b_{j}}} \right)}},$

and the other is the sum of differences squared (SDS) which is mathematically written as $\sum\limits_{i}\quad {\sum\limits_{j}\quad {\left( {a_{i} - b_{j}} \right)^{2}.}}$

The SAD measure is easy to implement in hardware. However, though the SDS operation requires greater precision to generate, the result is generally accepted to be of superior quality.

For real time, high-quality video image decompression, the decompression algorithm must be simple enough to be able to produce 30 frames of decompressed images per second. The speed requirement for compression is often not as extreme as for decompression, since in many situations, images are compressed offline. Even then, however, compression time must be reasonable to be commercially viable. In addition, many applications require real time compression as well as decompression, such as real time transmission of live events; e.g., video teleconferencing.

Dedicated digital signal processors (DSPs) are the traditional workhorses generally used to carry out these kinds of operations. Optimized for number crunching, DSPs are often included within multimedia devices such as sound cards, speech recognition cards, video capture cards, etc. DSPs typically function as coprocessors, performing the complex and repetitive mathematical computations demanded by the data compression algorithms, and performing specific multimedia-type algorithms more efficiently than their general purpose microprocessor counterparts.

However, the never ending quest to improve the price/performance ratio of personal computer systems has spawned a generation of general purpose microprocessors which effectively duplicate much of the processing capacity traditionally provided by DSPs. One line of development is the reduced instruction set computer (RISC). RISC processors are characterized by a smaller number of instructions which are simple to decode, and by requiring that all arithmetic/logic operations be performed in register-to-register manner. Another feature is that there are no complex memory access operations. All memory accesses are register load/store operations, and there are a comparatively smaller number of relatively simpler addressing modes; i.e., only a few ways of specifying operand addresses. Instructions are of only one length, and memory accesses are of a standard data width. Instruction execution is of the direct hardwired type, as compared to microcoding. There is a fixed instruction cycle time, and the instructions are defined to be relatively simple so that they all execute in one or a few cycles. Typically, multiple instructions are simultaneously in various states of execution as a consequence of pipeline processing.

To make MPEG, JPEG, H.320, etc., more viable as data compression standards, enhancements to existing RISC architectures processors and to existing instruction sets have been made. Other modern digital services, such as broadband networks, set-top box CPU's, cable systems, voice-over IP equipment, and wireless products, conventionally implemented using DSP methodology, would also benefit by having increased processing capacity in a single general-purpose processor. More generally, digital filter applications which traditionally are implemented by DSP technology would benefit from the additional processing capability provided by a general-purpose processor having DSP capability.

The instruction set architecture (ISA) of many RISC processors include single-instruction-multi-data (SIMD) instructions. These instructions allow parallel operations to be performed on multiple elements of a vector of data with corresponding elements of another vector. These types of vector operations are common to many digital applications such as image processing. Another critical area is in the field of data encryption and decryption systems. Coding of information is important for secured transactions over the Internet.and for wireless communication systems.

Therefore it is desirable to further enhance the performance of the RISC architecture. It is desirable to improve the performance capability of RISC processor cores to provide enhanced multimedia applications and in general to meet the computing power demanded by next generation consumer products. What is needed are enhancements of the ISA for vectored processing instructions. It is also desirable to provide an improved microarchitecture for a RISC-based processor in the areas of vectored data processing.

SUMMARY OF THE INVENTION

In RISC-based architecture, a method for shifting packed data of M N-bit elements includes a first step of a bit-level shift in which the datum is shifted by 0-7 bit positions. This is followed by a byte-level shift, wherein the bit-shifted datum is further shifted in 8-bit increments to produce an intermediate result. A mask is produced based on the shift amount. The final result is produced by selecting bits from the intermediate result or outputting a preselected bit value. In one embodiment, the preselected value is either logic ‘1’ or logic ‘0’ depending on the sign bit of the M N-bit elements.

A method for transferring bits from a first general purpose register to a second general purpose register includes basing the transfer on the contents of a third general purpose register. Each bit in the first register is copied to the same bit position in the second register if the correspondingly positioned bit in the third register is in a first logic state.

These and other advantages of the invention can be appreciated more fully from the following discussion of the various embodiments of the invention as shown in the figures and explained below.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 shows a vectored multiplication unit in connection with certain multimedia instructions of the invention.

FIG. 2 illustrates additional detail of the overflow detection logic shown in FIG. 1.

FIG. 3 shows additional detail of the multiplier circuits shown in the multiplication unit of FIG. 1.

FIG. 4 is a schematic illustration of the adder circuit shown in FIG. 1.

FIG. 5 is an alternate embodiment of the multiplier circuits shown in the multiplication unit of FIG. 1 in connection with certain multimedia instructions of the invention.

FIG. 6 illustrate additional logic for the multiplication unit of FIG. 1 in connection with certain multimedia instructions of the invention.

FIG. 7 shows a vector transposition unit in connection with certain multimedia instructions of the invention.

FIG. 8 is a bit manipulation circuit in connection with certain multimedia instructions of the invention.

FIGS. 9 and 10 illustrate the manipulations in reference to FIG. 8 during execution of certain multimedia instructions of the invention.

FIG. 11 shows logic used in the matrix shown in FIG. 8 in connection with certain multimedia instructions of the invention.

DESCRIPTION OF THE SPECIFIC EMBODIMENTS

It is a characteristic in RISC architectures that its operations are register-to-register. The data sources are registers and the data destinations are registers. Consequently, a register file is provided as a pool of general purpose registers for the various integer operations typically performed by a central processing unit. In accordance with the invention, the general purpose registers comprising the register file are the data sources and data destinations for the various vectored operations disclosed and described below. To emphasize this fact, FIG. 1 explicitly shows a register file 102 of N general purpose registers R₀-R_(n−1). Each register is sixty-four bits in length.

An aspect of the invention comprises improvements in the areas relating to multiplication operations of vectored data. FIG. 1 shows a simplified schematic of a multiplication unit 100 in accordance with the invention. In order to simplify the illustration of this otherwise complicated circuit, only the major functional blocks of the multiplication unit are highlighted. It will be understood by those of ordinary skill in the relevant arts that various control signals and other supporting logic, not otherwise germane to the discussion of the invention, are included.

The multiplication unit 100 is a three-stage pipelined processing unit. Each stage is separated from the other by pipeline latches P1, P2, and P3. Typically, the pipeline latches comprise a bank of flip-flops. Pipeline latches temporarily hold data from the previous stage between clock cycles. This serves to synchronize the flow of data from one stage to the next. The pipeline latches also serve to isolate the data between stages. This is important since an advantage of pipeline processing is that different instructions can be executing in each of the pipeline stages.

Multiplication unit 100 provides its inputs and outputs data via operands A, B, and C. Each operand is a 64-bit bus. Each 64-bit bus is coupled through logic (not shown) to one of the general purpose registers from register file 102. This establishes data communication between the multiplication unit and the register file. Typically, this occurs during an instruction decoding phase of processor operation.

As can be seen in FIG. 1, the 64-bit buses of operands A, B, and C feed into stage 1 via pipeline latch P1. Upon receiving a clocking signal, A, B, and C are clocked in and become source lines src1, src2, and src3, each source ‘line’ comprising 64 bitlines. Source line src1 and src2 feed into selector circuit 110, typically a multiplexer circuit. Source line src3 passes through stage 1, to pipeline latch P2 and into the second stage. Selector circuit 110 groups each source line, src1 and src2, into four groups of wordlines. Thus, the 64 bitlines of source line src1 can be represented conventionally as src1[63:0], bit positions 63-0. Selector circuit 110 groups src1 as:

src1[63:48], src1[47:32], src1[31:16], and src1[15:0].

Similarly, the 64 bitlines of src2 are grouped as:

src2[63:48], src2[47:32], src2[31:16], and src2[15:0].

For the purposes of the this application, “little endian” bit, byte (8 bits), and word (16 bits) ordering is used. In this convention, the higher order elements are stored in the higher-numbered bit positions. The alternative convention is “big endian,” in which the higher order elements are stored in the lower-numbered bit positions.

Continuing with FIG. 1, selector circuit 110 provides four pairs of output lines, x₃/y₃, x₂/y₂, x₁/y₁, and x₀/y₀. Each output line comprises 16 bitlines. Selector circuit 110 is designed to map the eight 16-bit groups from src1 and src2 onto the eight wordlines x_(n), y_(n). Selector circuit 110 provides the following sequences, one for 16-bit multiplication and another for 32-bit multiplication. The significance of these sequences will become clear in the discussion of the instructions: $\begin{matrix} \underset{\_}{16\text{-}{bit}\quad {sequence}} & \underset{\_}{32\text{-}{bit}\quad {sequence}\quad I} & \underset{\_}{32\text{-}{bit}\quad {sequence}\quad {II}} \\ \begin{matrix} \left. {{src1}\left\lbrack {63\text{:}48} \right\rbrack}\Rightarrow x_{3} \right. \\ \left. {{src1}\left\lbrack {47\text{:}32} \right\rbrack}\Rightarrow x_{2} \right. \\ \left. {{src1}\left\lbrack {31\text{:}16} \right\rbrack}\Rightarrow x_{1} \right. \\ \left. {{src1}\left\lbrack {15\text{:}0} \right\rbrack}\Rightarrow x_{0} \right. \end{matrix} & \begin{matrix} \left. {{src1}\left\lbrack {31\text{:}16} \right\rbrack}\Rightarrow x_{3} \right. \\ \left. {{src1}\left\lbrack {31\text{:}16} \right\rbrack}\Rightarrow x_{2} \right. \\ \left. {{src1}\left\lbrack {15\text{:}0} \right\rbrack}\Rightarrow x_{1} \right. \\ \left. {{src1}\left\lbrack {15\text{:}0} \right\rbrack}\Rightarrow x_{0} \right. \end{matrix} & \begin{matrix} \left. {{src1}\left\lbrack {63\text{:}48} \right\rbrack}\Rightarrow x_{3} \right. \\ \left. {{src1}\left\lbrack {63\text{:}48} \right\rbrack}\Rightarrow x_{2} \right. \\ \left. {{src1}\left\lbrack {47\text{:}32} \right\rbrack}\Rightarrow x_{1} \right. \\ \left. {{src1}\left\lbrack {47\text{:}32} \right\rbrack}\Rightarrow x_{0} \right. \end{matrix} \\ \begin{matrix} \left. {{src2}\left\lbrack {63\text{:}48} \right\rbrack}\Rightarrow y_{3} \right. \\ \left. {{src2}\left\lbrack {47\text{:}32} \right\rbrack}\Rightarrow y_{2} \right. \\ \left. {{src2}\left\lbrack {31\text{:}16} \right\rbrack}\Rightarrow y_{1} \right. \\ \left. {{src2}\left\lbrack {15\text{:}0} \right\rbrack}\Rightarrow y_{0} \right. \end{matrix} & \begin{matrix} \left. {{src2}\left\lbrack {31\text{:}16} \right\rbrack}\Rightarrow y_{3} \right. \\ \left. {{src2}\left\lbrack {15\text{:}0} \right\rbrack}\Rightarrow y_{2} \right. \\ \left. {{src2}\left\lbrack {31\text{:}16} \right\rbrack}\Rightarrow y_{1} \right. \\ \left. {{src2}\left\lbrack {15\text{:}0} \right\rbrack}\Rightarrow y_{0} \right. \end{matrix} & \begin{matrix} \left. {{src2}\left\lbrack {63\text{:}48} \right\rbrack}\Rightarrow y_{3} \right. \\ \left. {{src2}\left\lbrack {47\text{:}32} \right\rbrack}\Rightarrow y_{2} \right. \\ \left. {{src2}\left\lbrack {63\text{:}48} \right\rbrack}\Rightarrow y_{1} \right. \\ \left. {{src2}\left\lbrack {47\text{:}32} \right\rbrack}\Rightarrow y_{0} \right. \end{matrix} \end{matrix}$

The eight wordlines x_(n), y_(n), feed into four 16×16 multiplier circuits 120-126. Wordlines x₀/y₀ feed into circuit 120, wordlines x₁/y₁ feed into circuit 122, and so on. Each multiplier circuit 120-126 respectively includes overflow detection logic 130-136. The multiplier circuits produce four 33-bit sum lines, s₃-s₀, and four corresponding 33-bit carry lines, c₃-c₀. The extra bits on the sum and carry lines are sign bits produced in the multiplier circuits 120-126. The sum and carry lines feed into pipeline latch P2, separating stage 1 of multiplication unit 100 from the next stage, stage 2.

In stage 2, each of the four pairs of sum/carry lines s₃/c₃, s₂/c₂, s₁/c₁, s₀/c₀, are coupled to a 16-bit transposing circuit 152, a 32-bit transposing circuit 154, and a 64-bit transposing circuit 156. The transposing circuits each reorders the incoming 33-bit sum/carry pairs and pack them into a 64-bit sum/carry output pair. Depending on the transposing circuit, additional processing is performed. The significance of the transpositions will become clear in the discussion of the instruction set.

Transposing circuit 152 is used for 16-bit integer and fixed point multiplication operations. Its output 153 comprises a 64-bit sum line and a corresponding 64-bit carry line. Circuit 152 provides two transposition schemes for transposing the 33-bit sum/carry inputs to the 64-bit sum/carry output pair 153. For integer multiplication, only the lowest 16 bits of the four incoming 33-bit sum/carry pairs are packed into its 64-bit sum/carry output pair 153 namely, bits 0-15. For the fixed-point case, only the upper portion of the four 33-bit sum/carry pairs are packed into outputs 153. In particular, bit positions 15-30 are transferred.

integer transposition s₃[15:0] ⇒ bit  position  [63:48]  of  sum  output c₃[15:0] ⇒ bit  position  [63:48]  of  carry  output s₂[15:0] ⇒ bit  position  [47:32]  of  sum  output c₂[15:0] ⇒ bit  position  [47:32]  of  carry  output s₁[15:0] ⇒ bit  position  [31:16]  of  sum  output c₁[15:0] ⇒ bit  position  [31:16]  of  carry  output s₀[15:0] ⇒ bit  position  [15:0]  of  sum  output c₀[15:0] ⇒ bit  position  [15:0]  of  carry  output

fixed point transposition s₃[30:15] ⇒ bit  position  [63:48]  of  sum  output c₃[30:15] ⇒ bit  position  [63:48]  of  carry  output s₂[30:15] ⇒ bit  position  [47:32]  of  sum  output c₂[30:15] ⇒ bit  position  [47:32]  of  carry  output s₁[30:15] ⇒ bit  position  [31:16]  of  sum  output c₁[30:15] ⇒ bit  position  [31:16]  of  carry  output s₀[30:15] ⇒ bit  position  [15:0]  of  sum  output c₀[30:15] ⇒ bit  position  [15:0]  of  carry  output

Preferably, transposing circuit 152 comprises a set of bit-level muxes. Alternative implementations are possible, however.

Transposing circuit 154 is used for full-width 16-bit multiplication operations. Its output 155 comprises a 64-bit sum line and a 64-bit carry line. Circuit 154 transposes either the lower two pairs of the incoming 33-bit sum/carry inputs or the upper two pairs of the incoming 33-bit sum/carry inputs to its 64-bit sum/carry output pair. Thus, s₃[31:0] ⇒ bit  position  [63:32]  of  sum  output c₃[31:0] ⇒ bit  position  [63:32]  of  carry  output s₂[31:0] ⇒ bit  position  [31:0]  of  sum  output c₂[31:0] ⇒ bit  position  [31:0]  of  carry  output or, s₁[31:0] ⇒ bit  position  [63:32]  of  sum  output c₁[31:0] ⇒ bit  position  [63:32]  of  carry  output s₀[31:0] ⇒ bit  position  [31:0]  of  sum  output c₀[31:0] ⇒ bit  position  [31:0]  of  carry  output.

Preferably, transposing circuit 154 comprises a set of multiplexers to select the upper or lower pairs of incoming sum/carry lines and to combine them to form the 64-bit output 155. The use for this circuit will become clear in the discussion relating to the instruction set. It is observed that the incoming sum and carry lines are 33 bits each. The uppermost bit (bit position 32), an extraneous sign bit in stage 2, is stripped during the transposition operation. For the MACFX.WL and MACNFX.WL instructions, bits [30:0] of s0/c0 and s1/c1 are transferred and a ‘0’ is loaded into bit [0] of the sum and carry output.

Transposing circuit 156 is used for full-width 32-bit multiply operations. Its output comprises four pairs of sum and carry lines sx₃/cx₃, sx₂/cx₂, sx₁/cx₁, sx₀/cx₀, each ‘line’ being 64 bitlines wide. Circuit 156 maps each of the incoming sum/carry pairs s₃/c₃, s₂/c₂, s₁/c₁, s₀/c₀ to the respective outgoing 64-bit sum/carry pairs sx₃/cx₃, sx₂/cx₂, sx₁/cx₁, sx₀/cx₀. However, the incoming sum/carry pairs occupy different bit positions in the output sum/carry pairs. The mapping occurs in the following manner. The significance of this mapping will become clear in the discussion of the instruction set. s₃[31:0], c₃[31:0] ⇒ sx₃[63:48], cx₃[63:48]   s₂[31:0], c₂[31:0] ⇒ sx₂[47:16], cx₂[47:16]   s₁[31:0], c₁[31:0] ⇒ sx₁[47:16], cx₁[47:16] s₀[31:0], c₀[31:0] ⇒ sx₀[31:0], cx₀[31:0]

Preferably, circuit 156 comprises a set of wires which simply route the incoming sum/carry lines to the appropriate bit positions in the output lines. As in the case of circuit 154 above, the uppermost sign bit of each of the incoming lines is simply ignored, as it is an extraneous bit in stages 2 and 3 of the multiplication unit 100.

Stage 2 includes selector circuit 114. Outputs 153 of circuit 152 feed into the ‘a’ inputs of selector circuit 114. Similarly, outputs 155 of circuit 154 are coupled to the ‘b’ inputs of selector circuit 114. The selector circuit outputs either the ‘a’ inputs or the ‘b’ inputs to its output lines 115. The output 115 feeds into the ‘a’ inputs of another selector circuit 116.

The eight outputs, sx_(n)/cx_(n), of circuit 156 feed into an 8:2 compression circuit 140. The compression circuit produces a pair of 64-bit sum/carry outputs 141. These outputs feed into the ‘b’ inputs of selector circuit 116. The selector circuit selects either its ‘a’ or its ‘b’ input lines and provides the selected lines to the inputs of a 3:2 compression circuit 160.

It can be seen that, alternatively, outputs 153 and 155 could be tied directly into selector circuit 116. The configuration shown in FIG. 1, however, is preferred because the presence of selector 114 synchronizes the timing of the data flow with the data flow through compressor 140. Effectively, selectors 114 and 116 cooperate to act as a single 3:1 selector to select data from one of the three data transformation paths.

Yet another selector circuit 112 receives input line src3 in its ‘a’ input. Its ‘b’ input is coupled to a constant value “0.5.” Its ‘c’ input is coupled to a constant value “0.” The selected input of selector 112 is coupled to a third input of compression circuit 160. Compression circuit 160 combines its three inputs and produces two 64-bit outputs 161. These outputs are coupled to pipeline latch P3, separating stage 2 from stage 3.

In stage 3, the outputs 163 of pipeline latch P3 are comprised of the sum and carry lines from stage 2. The sum and carry lines feed into a carry-propagate adder circuit 170. The output of adder circuit 170 is 64 bits. The top half, bits [63:32], feed into the ‘a’ input of selector circuit 118. The bottom half, bits [31:0], feed into the ‘b’ input of selector circuit 119. A saturation value generator 182 feeds into the ‘a’ inputs of selector circuits 118 and 119.

The outputs 163 of pipeline latch P3 also feed into overflow detection logic circuits 180, 186. The low-order bits [31:0] of output 163 feed into detection logic 180. The high-order bits [63:32] feed into detection logic 186. The outputs of each circuit 180, 186 feed into selector inputs of respective selector circuits 118 and 119.

Detection logic 180 and 186 predict, based on its inputs, whether an overflow will occur for the addition operation that takes place in adder circuit 170. FIG. 2 shows additional detail for circuit 180. The low-order bits of each of the sum and carry inputs 181 namely, bits [31:0], feed into a carry generation circuit 202. This circuit is simply the carry generation logic of an adder circuit. The output of circuit 202 is a 32-bit carry. The upper two bits c[31] and c[30] are XOR'd by XOR gate 206. The output of gate 206 is AND'd with control signal MAC. The MAC control signal is asserted when either the MMACFX.WL or MACNFX.WL instructions are decoded for execution. The MAC control signal is de-asserted otherwise. Circuit 180 asserts output 183 when overflow is predicted to occur. Detection logic 186 is similarly configured and operates in the same manner. Output 187 will be asserted when overflow is going to occur based on the upper 32 bits of the sum and carry lines 163.

Returning to FIG. 1, if an overflow condition is predicted by logic 180, then selector circuit 118 will produce the ‘a’ input at its output 188. Otherwise, selector circuit 118 will produce the ‘b’ input at its output. As can be seen, output 188 comprises the upper 32 bits of output 190, which comprises the output of multiplication unit 100. Similarly, if an overflow condition is predicted by logic 186, then selector circuit 119 will produce the ‘a’ input at its output 189. Otherwise, selector circuit 119 will produce the ‘b’ input at its output. The output 189 comprises the lower 32 bits of output 190.

Referring now to FIG. 3, additional detail of multiplier circuits 120-126 is shown by the exemplary illustration for multiplier 120. It is understood that circuits 122-126 are configured similarly. Circuit 120 includes a Wallace adder tree 310 to provide 16×16 bit multiplication. The 16-bit input lines x₀ and y₀ from selector circuit 110 are combined by the Wallace adder tree. The output is a 33-bit carry line 304 and a 33-bit sum line 302. The 33^(rd) bit on each of the sum and carry lines is a sign bit. The sum and carry lines are coupled to the ‘b’ inputs of a selector circuit 330. Normally, selector circuit 330 will select the ‘b’ inputs as the c₀ and s₀ outputs of multiplier circuit 120.

In accordance with the invention, each multiplier circuit 120-126 includes overflow detection logic 130. The 16-bit input lines x₀ and y₀ coupled to Wallace tree 310 also couple to detection logic 130. The detection logic has an output coupled to the ‘a’ input of selector circuit 330. A saturation value generator 300 has an output also coupled to the ‘a’ input of selector circuit 330. The detection logic predicts, based on x₀ and y₀, whether an overflow will occur for 16-bit fixed point multiplications. If an overflow condition is predicted, then selector circuit 330 will select the ‘a’ inputs as the c₀ and s₀ outputs of multiplier circuit 120. In accordance with the invention, the detection logic in stage 1 detects whether both x₀ and y₀ are −1. This is an overflow condition for fixed-point multiplication since the maximum positive value using fixed-point notation is 1−2⁻¹⁵ for 16-bit data and 1−2⁻³² for 32-bit data.

Referring to FIG. 4, adder circuit 170 of stage 3 comprises four adder stages. The incoming 64-bit sum and carry lines 163 are grouped into four sets of 16-bit lines. Each adder stage includes a full adder circuit 400-403. The low-order 16-bit sum/carry line group, s[15:0], c[15:0], is coupled to the inputs of full adder 400, the next 16-bit sum/carry line group, s[31:16], c[31:16], is coupled to the inputs of full adder 401, the sum/carry line group s[47:32], c[47:32] is coupled to the inputs of full adder 402, and the high-order 16-bit sum/carry line group is coupled to full adder 403.

The full adders are coupled together through selector circuits 420-424 to provide a selectable ripple-carry configuration. The carry-out of adder 400 is coupled to the ‘a’ input of selector circuit 420. The output of selector circuit 420 is coupled to the carry-in of adder 401. In turn, the carry-out of adder 401 feeds into the ‘a’ input of selector circuit 422, the output of which is coupled to the carry-in of adder 402. The carry-out of adder 402 is coupled to the ‘a’ input of selector circuit 424. The output of selector circuit 424 feeds into the carry-in of adder 403. The ‘b’ inputs of selector circuits 420-424 are coupled to constant value “0.” The carry-in of adder 400 also is coupled to constant value “0.” The 16-bit outputs of the adder circuits are combined to produce the 64-bit output of adder 170. As explained above the output of adder 170 then feeds into selector circuits 118 and 119.

In another embodiment of the invention, multiplier circuits 120-126 of stage 1 in FIG. 1 have an alternate configuration. FIG. 5 is an exemplary illustration of alternate multiplier circuits 120′-126′ shown substituting circuit 120-126. The configuration shown in FIG. 5 is used for implementing certain instructions which will be discussed below.

The additional detail of multiplier 120′ shows a modified 16×16 Wallace tree adder 530. Output line x₀ of selector circuit 110 is one input to the Wallace tree adder. The other input to the Wallace tree comes from a selector circuit 520. The ‘a’ input of selector circuit 520 is coupled to output line y₀ of selector circuit 110. Output line y₀ is inverted to produce a 1's complement output, which is coupled to the ‘b’ input of selector circuit 520. The inversion logic 510 can be provided by sixteen inverters. Selector circuit 520 and the modified Wallace tree receive control signals CTL1.

Control signals CTL1 are produced in response to decoding the MMACNFX.WL instruction. When CTL1 is asserted, selector circuit 520 produces the ‘b’ inputs which feed the 1's complement of y₀ into the modified Wallace tree. Moreover, the Wallace tree is modified s0 that when CTL1 is asserted, a constant value “1” is added to the product of its inputs. In effect, this is the same as inverting y₀ and then adding a “1.” This operation produces the two's complement of y₀. Thus, asserting CTL1 results in multiplication of x₀ by −y₀.

As in the configuration shown in FIG. 3, the Wallace tree inputs also feed into overflow detection logic 130. As discussed in connection with FIG. 3, saturation value generator 300 produces an output that is coupled to the ‘a’ input of selector circuit 330. When detection logic 130 determines that overflow will occur, selector circuit 330 will produce the saturation value from its ‘a’ inputs.

Refer now to FIG. 6 for yet another embodiment of the invention. Shown is additional logic which resides in stage 1 of the multiply unit 100. In addition to the multiplier circuits 120-126, are subtraction units 601-608. Additional detail is provided with reference to subtraction unit 601. The subtraction unit 601 receives two 8-bit inputs, x₀ and y₀. The x₀ input feeds into a full adder 621 and an inverter bank 611 of eight inverters. The output of inverter bank 611 feeds into a second full adder 641. The y₀ input is coupled to the second input of full adder 641 and to another bank of eight inverters 631. The outputs of inverters 631 are coupled to the second input of full adder 621. The carry-in's of both full adders are coupled to a constant value “1.” The output of full adder 621 is coupled to the ‘a’ input of selector circuit 651, while the ‘b’ input of the selector circuit receives the output of full adder 641.

With respect to full adder 621, the combined effect of inverting y₀ and supplying a “1” to the carry-in is the production of the ‘2’s complement of y₀, thus producing −y₀. Full adder 621, therefore, computes the quantity (x₀−y₀). Similarly with respect to full adder 641, the combined effect of inverting x₀ and supplying a “1” to the carry-in is to create the ‘2’s complement of x₀. Full adder 641, therefore, computes the quantity (−x₀+y₀).

The selector circuit's select input is coupled to one of the carry-out's of the full adders; the other carry-out being ignored. By connecting the appropriate carry-out of one of the full adders to the selector of selector circuit 651, the effect is to produce at the output of subtraction unit 601 the absolute value of (x₀−y₀).

FIG. 6 shows eight subtraction units 601-608. Each unit operates on 8-bit groupings of the outputs x₃/y₃, x₂/y₂, x₁/y₁, and x₀/y₀ of selector circuit 110. For example, subtraction unit 601 operates on the 8-bit set x₀[7:0] and y₀[7:0]. Subtraction unit 602 operates on the 8-bit set x₀[15:8] and y₀[15:8], and so on.

A selector circuit 660 receives the sum and carry outputs of the multiplier circuits 120-126. Selector circuit 660 also receives the outputs of the subtraction units. The output of selector circuit 660 therefore presents to pipeline latch P2 either the eight sum/carry lines s₃/c₃, s₂/c₂, s₁/c₁, s₀/c₀, or the eight outputs of subtraction units 601-608. Note that the outputs of the substraction units are 8-bit results. However, the sum/carry lines are 33 bits each. Therefore, the 8-bit results of the subtraction units are zero-extended to fit into 33 bits before being latched into the pipeline latch P2.

Another aspect of the invention lies in improvements in the area of instructions relating to various transpose operations of vectored data. Shuffle logic 700 provided in accordance with the invention is schematically illustrated by the circuitry shown in FIG. 7. A pair of general purpose registers are accessed from register file 102 and fed into the 64-bit src1 and src2 input lines. The input lines are coupled into a bit shifting circuit 702. As will be discussed further, bit shifter 702 provides bit-level shifting of src1. Moreover, bit shifter 702 provides left- and right-direction shifting and shifting of one to seven bit positions in either of those directions. Bit shifter 702 includes a left/right control input 752 to select left or right shifting. Another control input 754 is a 3-bit shift input specifying the shift amount. The shift amount is contained in src2 which feeds into shift input 754.

The two 64-bit outputs of bit shifter 702 represent src1 and src2 after being left or right shifted by anywhere between 0-7 bit positions. The outputs couple into a matrix 704. A control input 756, derived from src2, feeds into matrix 704. The matrix 704 can select any 64 of its 128 (2×64) input bitlines and produce them, in any order, at its 64 output bitlines. Each of the 64 output bitlines feeds into the ‘a’ input of a selector circuit 740.

Some of the source lines src1 also feed into a sign generator 708. The 64 output bitlines of the sign generator each feed into the ‘b’ inputs of the selector circuits 740. A mask generator 710 receives the shift amount in src2. The mask generator produces outputs which operate selector circuits 740. The significance of sign generator 708 and mask generator 710 will be discussed below in connection with the instruction set.

The outputs of selector circuits 740 are latched into latches 712. The latch 712 also receives the outputs of the bit shifter 702. The latch serves to synchronize the arrival of data from the bit shifter 702 and the matrix 704. The outputs of selectors 740 couple to the ‘a’ inputs of selector circuit 724 and the an input of an overflow detection circuit 720. The outputs of bit shifter 702 also feed into overflow detection circuit 720. A saturation value generation circuit 722 provides an input to detection circuit 720 and feeds into the ‘b’ input of selector circuit 724. Selector circuit 724 produces either its ‘a’ input or its ‘b’ input in response to an output of detection circuit 720.

Referring now to FIG. 8, additional logic 800 for transpose operations in accordance with the invention includes a latch 870 for latching in three sources, src1, src2, and src3, from general purpose register file 102. Each of the 64 bitlines of each of src1 and src3 respectively feed into the single-bit ‘a’ and ‘b’ inputs of selector circuits 801-863. Selector circuit 863 is an exemplary illustration of a typical design of such a 2:1 selector circuit. The selector controls of the selector circuits are supplied by the 64 bitlines of src2. The selector circuit outputs are combined to produce a 64-bit output 880.

Having described the circuitry of the invention, the discussion will now turn to the operation of the foregoing circuits in connection with the instruction set. The following notational convention is used to represent the various data formats supported by the instructions. Source registers are designated by Rm and Rn, and the destination register is designated by Rd. The data size is 64 bits, and the data ordering convention places the lower order data in the lower numbered positions. bit-level  operation  - Rx:  Rx₆₃, Rx₆₂, …  Rx₁, Rx₀,  x = 1, 2, 3 byte-level  (8  bits)  operation  - Rx:  Rx_(b7), Rx_(b6), Rx_(b5), Rx_(b4), Rx_(b3), Rx_(b2), Rx_(b1), Rx_(b0),  x = 1, 2, 3 word-level  (16  bits)  operation  - Rx:  Rx_(w3), Rx_(w2), Rx_(w1), Rx_(w0),  x = 1, 2, 3 long  word  (32  bits)  operation  - Rx:  Rx_(L1), Rx_(L0),  x = 1, 2, 3

Each of the instructions has the following assembly-level instruction format:

OP-CODE (6 bits): Rm (6 bits): OP-EXT (4 bits): Rn (6 bits): Rd (6 bits)

The OP-EXT field is used for instructions which are identical in function but differ by an a numeric value; e.g., MEXTR*. Each assembly-level instruction is translated to a corresponding machine-level instruction, comprising a series of ones and zeroes. The machine-level instruction is decoded to produce various control signals which operate the various logic to effectuate execution of the decoded instruction.

Depending on the instruction, the operand(s) may contain packed (vectored) data. This is a known convention wherein two or more N-bit, independent data elements are contained in one operand. Each datum is N bits in size. The operation performed on each of the data is executed independently of the other, though it is the same operation.

MMUL.W

This is a packed (vectored) 16-bit multiply instruction. Each of the two operands Rm, Rn contains four independent 16-bit words. The result Rd comprises four 16-bit values. Rm:  Rm_(w3), Rm_(w2), Rm_(w1), Rm_(w0) Rn:  Rn_(w3), Rn_(w2), Rn_(w1), Rn_(w0) Rd:  Rm_(w3) × Rn_(w3), Rm_(w2) × Rn_(w2), Rm_(w1) × Rn_(w1), Rm_(w0) × Rn_(w0)

The 16-bit×16-bit multiplication results in a 32-bit quantity. Consequently, for the purposes of this instruction, the result of each multiplication is down-converted to 16 bit format using modulo arithmetic.

With respect to FIG. 1, decoding of this instruction will produce appropriate control signals (not shown) to output the contents of Rm to the src1 data lines and the contents of Rn to the src2 data lines. The data is latched into pipeline latch P1 and clocked into selector circuit 110. Selector circuit 110 is controlled to provide the following output of x and y lines:

x₃—src1[63-48](Rm_(w3)), x₂—src1[47-32](Rm_(w2)), x₁—src1[31-16](Rm_(w1)), x₀—src1[15-0](Rm_(w0))

y₃—src2[63-48](Rn_(w3)), y₂—src2[47-32](Rn_(w2)), y₁—src2[31-16](Rn_(w1)), y₀—src2[15-0](Rn_(w0))

The x and y lines feed into their respective multiplier circuits 120-126. Sum/carry outputs s₃/c₃, s₂/c₂, s₁/c₁, s₀/c₀, are produced at the outputs of multipliers 120-126 and latched into P2.

Each sum/carry pair (e.g., s₀/C₀) contains the respective 16×16 product of operands Rm and Rn (e.g., Rm_(w0)×Rn_(w0)). For the purposes of the MMUL.W instruction, only the path through circuit 152 is relevant, though the sum/carry pairs in stage 2 feed into transpose circuits 152, 154, and 156. The upper seventeen bits of each of the pairs of sum/carry lines are masked out leaving the lower sixteen bits, recalling that the sum/carry pairs are 33-bit lines. This masking out step is referred to as a down-conversion of 32-bit the results into 16-bit quantities via modulo arithmetic. In addition, circuit 152 packs the four pairs of 16-bit results into the 64-bit carry and sum lines 153.

Lines 153 feed through selector circuit 114 and selector circuit 116 into compression circuit 160. Selector circuit 112 is operated to produce the “0” constant (input ‘c’), thus feeding a “0” into compression circuit 160. Inputting a “0” to compression circuit 160 has the effect of passing its inputs 117 directly to its outputs 161. The compression circuit is thus effectively bypassed and behaves like a pass-through device, feeding its inputs 117 directly to P3 without compression.

With respect to FIGS. 1 and 4, the outputs 163 from the P3 latches feed into adder circuit 170. Selector circuits 420-424 are controlled to produce their respective ‘b’ inputs at the selector circuit outputs. Thus, constant “0” is passed into the carry-in of each of the full adders 400-403. Doing this configures the full adders as four independent full adder units, thus providing four independent addition operations on its inputs. Moreover, the four independent addition operations are executed simultaneously, since each circuit is a self-contained full-adder. This is precisely the effect desired for the MMUL.W instruction. Since the four packed words are independent values, the result should be four independent product terms. Moreover, the four independent addition operations are executed simultaneously, since each circuit is a self-contained full-adder. For MMUL.W, the detection logic 180 and 186 shown in FIG. 1 is not used. Selector circuits 118 and 119 therefore produce their ‘b’ inputs in response to control signals produced during by the decoding of MMUL.W, thereby forming the 64-bit result.

MMULFX.W

MULFXRP.W

These are packed (vectored) 16-bit, fixed-point multiply instructions. Each of the two operands Rm, Rn contains four independent 16-bit words. The result Rd comprises four 16-bit values. The MMULFXRP.W instruction includes rounding. Rm:  Rm_(w3), Rm_(w2), Rm_(w1), Rm_(w0) Rn:  Rn_(w3), Rn_(w2), Rn_(w1), Rn_(w0) Rd:  Rm_(w3) × Rn_(w3), Rm_(w2) × Rn_(w2), Rm_(w1) × Rn_(w1), Rm_(w0) × Rn_(w0)

These instructions are processed in the same manner as discussed above for MMUL.W with the following differences to account for the fixed-point format of the operands of MMULFX.W and MMULFXRP.W:

Since a 16-bit×16-bit multiplication results in a 32-bit quantity, the result of the fix-point multiplication is down converted to 16 bits with saturation. The down-conversion involves retaining only the most significant 16 bits of the 32-bit result. Saturation is a known process. When the result of an arithmetic operation requires more bits than a given data type can hold, the result is clamped to the maximum or minimum number that can be represented by that data type. For example, if the result must fit into a 16-bit signed integer but the result is a 20-bit value, saturation of the result would produce a value of 2¹⁵−1 (maximum value for 16-bit signed integer) or −2⁻¹⁵ (minimum value for 16-bit signed integer), depending on the sign of the result. In the case of 16-bit fixed-point values, the range is −1 to (1−2⁻¹⁵).

Thus, for these fixed-point multiplies, overflow detection is performed in the multiply circuits 120-126 of stage 1. As discussed in connection with FIG. 3, detection logic 130 determines when both of its inputs are −1. When that occurs, selector circuit 330 produces its ‘a’ inputs. Since saturation generator outputs (1−2⁻¹⁵) for MMULFX.W and MMULFXRP.W, the sum and carry lines, s₀ and C₀ will respectively be set to “0” and (1−2⁻¹⁵), or vice-versa. This also happens for the other sum and carry lines s₃/c₃, s₂/c₂, and s₁/c₁. In this manner, the overflow condition is detected and handled for each of the four product terms.

In stage 2, the s₃/c₃, s₂/c₂, s₁/c₁, and s₀/c₀ lines are packed into 64-bit lines 153 by transpose circuit 152. For the purposes of the MMULFX.W and MMULFXRP.W instructions, only the path through circuit 152 is relevant, though the sum/carry pairs in stage 2 feed into transpose circuits 152, 154, and 156. The lines 153 are then coupled into compression circuit 160 via selector circuits 114 and 116. For MMULFX.W, the circuit 112 feeds constant “0” into the compression circuit. Consequently, there is no compression of the input for the MMULFX.W instruction. For fixed point operations, the result is left-shifted by 1 in order to maintain the fixed point representation of the result. The output of compression circuit is latched to P3.

As for the MMULFXRP.W instruction, rounding occurs in stage 2. Selector circuit 112 produces the “0.5” constant. Since the instruction operates on 16-bit data, selector 112 produces four copies of “0.5” in fixed point format and packs them into its 64-bit output 113. Each constant is combined in compression circuit 160 with its corresponding sum and carry lines s₃/c₃, s₂/c₂, s₁/c₁, and s₀/c₀ from circuit 152. This produces the rounding operation for MMULFXRP.W. Processing then passes on and continues in stage 3.

With respect to FIGS. 1 and 4, the outputs 163 from the P3 latches feed into adder circuit 170. Selector circuits 420-424 are controlled to produce their respective ‘b’ inputs at the selector circuit outputs. Thus, constant “0” is passed into the carry-in of each of the full adders 400-403. The full adders, therefore, are configured as four separate adder units, each providing an add operation on its inputs independently of the other inputs. This is precisely the effect desired for the MMULFX.W and MMULFXRP.W instructions. Since the four packed words are independent values, the result should be four independent products terms.

MMUL.L

This is a packed (vectored) 32-bit multiply instruction. Each of the two operands Rm, Rn contains two independent 32-bit words. The result Rd comprises two 32-bit values. Rm:  Rm_(L1), Rm_(L0) Rn:  Rn_(L1), Rn_(L0) Rd:  Rm_(L1) × Rn_(L1), Rm_(L0) × Rn_(L0)

The 32×32 multiplication results in a 64-bit quantity. Consequently, for the purposes of this instruction, the result of each multiplication is down-converted to 32-bit format using modulo arithmetic.

In accordance with the invention, 32-bit multiplication is performed by splitting each 32-bit operand into two 16-bit elements. The multiplication can then proceed as independent 16-bit operations and the intermediate results combined to produce a 64-bit result. This allows re-use of the existing 16-bit multipliers 120-126 shown in FIG. 1 to provide 32-bit multiplication.

A 32-bit number, A, has the form: $\begin{matrix} {{{A_{h} \times 2^{16}} + A_{l}},} & {where} & {{A_{h}\quad {is}\quad {the}\quad {uppermost}\quad {word}\quad {of}\quad A},{A\left\lbrack {31\text{:}16} \right\rbrack}} \\ \quad & \quad & {{A_{l}\quad {is}\quad {the}\quad {low}\quad {word}\quad {of}\quad A},{{A\left\lbrack {15\text{:}0} \right\rbrack}.}} \end{matrix}$

Thus, A×B can be represented as: $\begin{matrix} {\left( {{A_{h} \times 2^{16}} + A_{l}} \right) \times \left( {{B_{h} \times 2^{16}} + B_{l}} \right)} & {{Eqn}.\quad 1} \\ {= {{A_{h} \times 2^{16} \times B_{h} \times 2^{16}} + {A_{h} \times 2^{16} \times B_{l}} + {B_{h} \times 2^{16} \times A_{l}} + {A_{l} \times B_{l}}}} & {{Eqn}.\quad 2} \\ {= {{A_{h} \times B_{h} \times 2^{32}} + {\left( {{A_{h} \times B_{l}} + {B_{h} \times A_{l}}} \right) \times 2^{16}} + {A_{l} \times B_{l}}}} & {{Eqn}.\quad 3} \end{matrix}$

Borrowing from algebra, the foregoing can be viewed as a polynomial expansion of a product of two binomials. The first binomial term is (A_(h)×2¹⁶+A₁) and the second binomial term is (B_(h)×2¹⁶+B₁). The polynomial expansion is represented by Eqn 3.

With respect to FIG. 1, decoding of the MMUL.L instruction will produce appropriate control signals (not shown) to output the contents of Rm to the src1 data lines and the contents of Rn to the src2 data lines. The data is latched into pipeline latch P1 and is clocked into selector circuit 110 during a first cycle of instruction execution. The control signals corresponding to MMUL.L operate selector circuit 110 to map the src1 and src2 data lines to the x and y lines in the following manner: $\begin{matrix} \underset{\_}{32\text{-}{bit}\quad {mapping}} & \underset{\_}{32\text{-}{bit}\quad {mapping}\quad ({alt})} & \underset{\_}{{register}\quad {content}\quad ({alt})} \\ \begin{matrix} \left. {{src1}\left\lbrack {31\text{:}16} \right\rbrack}\Rightarrow x_{3} \right. \\ \left. {{src1}\left\lbrack {31\text{:}16} \right\rbrack}\Rightarrow x_{2} \right. \\ \left. {{src1}\left\lbrack {15\text{:}0} \right\rbrack}\Rightarrow x_{1} \right. \\ \left. {{src1}\left\lbrack {15\text{:}0} \right\rbrack}\Rightarrow x_{0} \right. \end{matrix} & \begin{matrix} \left. {{src1}\left\lbrack {15\text{:}0} \right\rbrack}\Rightarrow x_{2} \right. \\ \left. {{src1}\left\lbrack {31\text{:}16} \right\rbrack}\Rightarrow x_{1} \right. \end{matrix} & \begin{matrix} {Rm}_{h0} \\ {{Rm}_{h0}\left( {Rm}_{l0} \right)} \\ {{Rm}_{l0}\left( {Rm}_{h0} \right)} \\ {Rm}_{l0} \end{matrix} \\ \begin{matrix} \left. {{src2}\left\lbrack {31\text{:}16} \right\rbrack}\Rightarrow y_{3} \right. \\ \left. {{src2}\left\lbrack {15\text{:}0} \right\rbrack}\Rightarrow y_{2} \right. \\ \left. {{src2}\left\lbrack {31\text{:}16} \right\rbrack}\Rightarrow y_{1} \right. \\ \left. {{src2}\left\lbrack {15\text{:}0} \right\rbrack}\Rightarrow y_{0} \right. \end{matrix} & \begin{matrix} \left. {{src2}\left\lbrack {31\text{:}16} \right\rbrack}\Rightarrow y_{2} \right. \\ \left. {{src2}\left\lbrack {15\text{:}0} \right\rbrack}\Rightarrow y_{1} \right. \end{matrix} & \begin{matrix} {Rn}_{h0} \\ {{Rn}_{l0}\left( {Rn}_{h0} \right)} \\ {{Rn}_{h0}\left( {Rn}_{l0} \right)} \\ {Rn}_{l0} \end{matrix} \end{matrix}$

The “alternative” mapping recognizes the commutative property of the addition operation for the term (A_(h)×B₁+B_(h)×A₁) in Eqn. 3.

Notice that in the first pipeline execution cycle, only the low order longword from each of src1 and src2 is selected and provided to the multiplier circuits in stage 1. The low order longword reference is indicated by the “0” subscript designation in the register names (e.g., Rm_(h0)). During the second cycle of pipeline execution, when the sum/carry outputs from the first cycle proceed into stage 2, the high order longwords of src1 and src2 are selected and provided to multiplier circuit 120-126. Consequently, the MMUL.L instruction requires an extra cycle to complete. Thus, during the second cycle, the following data selection occurs in stage 1: $\begin{matrix} \underset{\_}{32\text{-}{bit}\quad {mapping}} & \underset{\_}{32\text{-}{bit}\quad {mapping}\quad ({alt})} & \underset{\_}{{register}\quad {content}\quad ({alt})} \\ \begin{matrix} \left. {{src1}\left\lbrack {63\text{:}48} \right\rbrack}\Rightarrow x_{3} \right. \\ \left. {{src1}\left\lbrack {63\text{:}48} \right\rbrack}\Rightarrow x_{2} \right. \\ \left. {{src1}\left\lbrack {47\text{:}32} \right\rbrack}\Rightarrow x_{1} \right. \\ \left. {{src1}\left\lbrack {47\text{:}32} \right\rbrack}\Rightarrow x_{0} \right. \end{matrix} & \begin{matrix} \left. {{src1}\left\lbrack {47\text{:}32} \right\rbrack}\Rightarrow x_{2} \right. \\ \left. {{src1}\left\lbrack {63\text{:}48} \right\rbrack}\Rightarrow x_{1} \right. \end{matrix} & \begin{matrix} {Rm}_{h1} \\ {{Rm}_{h1}\left( {Rm}_{l1} \right)} \\ {{Rm}_{l1}\left( {Rm}_{h1} \right)} \\ {Rm}_{l1} \end{matrix} \\ \begin{matrix} \left. {{src2}\left\lbrack {63\text{:}48} \right\rbrack}\Rightarrow y_{3} \right. \\ \left. {{src2}\left\lbrack {47\text{:}32} \right\rbrack}\Rightarrow y_{2} \right. \\ \left. {{src2}\left\lbrack {63\text{:}48} \right\rbrack}\Rightarrow y_{1} \right. \\ \left. {{src2}\left\lbrack {47\text{:}32} \right\rbrack}\Rightarrow y_{0} \right. \end{matrix} & \begin{matrix} \left. {{src2}\left\lbrack {63\text{:}48} \right\rbrack}\Rightarrow y_{2} \right. \\ \left. {{src2}\left\lbrack {47\text{:}32} \right\rbrack}\Rightarrow y_{1} \right. \end{matrix} & \begin{matrix} {Rn}_{h1} \\ {{Rn}_{l1}\left( {Rn}_{h1} \right)} \\ {{Rn}_{h1}\left( {Rn}_{l1} \right)} \\ {Rn}_{l1} \end{matrix} \end{matrix}$

Continuing then, the x and y lines feed into their respective multiplier circuits 120-126. Sum/carry outputs s₃/c₃, s₂/c₂, s₁/c₁, s₀/c₀, are produced in the manner discussed in connection with FIG. 3.

The outputs of multipliers 120-126 are latched into P2. The sum/carry lines entering stage 2 represent the following product terms:

s₃/c₃=A_(h)×B_(h), s₂/c₂=A_(h)×B₁, s₁/c₁=B_(h)×A₁, s₀/c₀=A₁×B₁,

However, Eqn. 3 requires that some of the above terms be multiplied by powers of 2. This is provided by transpose circuit 156. For the purposes of the MMUL.L instruction, only the path through circuit 156 is relevant, though the sum/carry pairs in stage 2 feed into transpose circuits 152, 154, and 156.

As previously explained, incoming sum/carry pairs s₃/c₃, s₂/c₂, s₁/c₁, s₀/c₀ are mapped to their respective outgoing 64-bit sum/carry pairs sx₃/cx₃, sx₂/cx₂, sx₁/cx₁, sx₀/cx₀ in the following manner: $\begin{matrix} {{s_{3}\left\lbrack {31\text{:}0} \right\rbrack},\left. {c_{3}\left\lbrack {31\text{:}0} \right\rbrack}\Rightarrow{{sx}_{3}\left\lbrack {63\text{:}48} \right\rbrack} \right.,{{cx}_{3}\left\lbrack {63\text{:}48} \right\rbrack}} & \left( {\times 2^{32}} \right) \\ {{s_{2}\left\lbrack {31\text{:}0} \right\rbrack},\left. {c_{2}\left\lbrack {31\text{:}0} \right\rbrack}\Rightarrow{{sx}_{2}\left\lbrack {47\text{:}16} \right\rbrack} \right.,{{cx}_{2}\left\lbrack {47\text{:}16} \right\rbrack}} & \left( {\times 2^{16}} \right) \\ {{s_{1}\left\lbrack {31\text{:}0} \right\rbrack},\left. {c_{1}\left\lbrack {31\text{:}0} \right\rbrack}\Rightarrow{{sx}_{1}\left\lbrack {47\text{:}16} \right\rbrack} \right.,{{cx}_{1}\left\lbrack {47\text{:}16} \right\rbrack}} & \left( {\times 2^{16}} \right) \\ {{s_{0}\left\lbrack {31\text{:}0} \right\rbrack},\left. {c_{0}\left\lbrack {31\text{:}0} \right\rbrack}\Rightarrow{{sx}_{0}\left\lbrack {31\text{:}0} \right\rbrack} \right.,{{cx}_{0}\left\lbrack {31\text{:}0} \right\rbrack}} & \quad \end{matrix}$

Shifting sx₃/cx₃, sx₂/cx₂, and sx₁/cx₁ to the higher order positions effectuates multiplication by a power of 2. Since sx₃/cx₃ is shifted by 32 bits, the A_(h)×B_(h) becomes multiplied by 2³². Similarly for sx₂/cx₂ and sx₁/cx₁, but the multiplication is 2¹⁶.

The sum/carry lines sx₃/cx₃, sx₂/cx₂, sx₁/cx₁, sx₀/cx₀, therefore, represent the intermediate product terms of Eqn. 3. The eight lines feed into 8:2 compression circuit 140 to produce a pair of carry and sum lines 141. Lines 141 feed into 3:2 compressor 160 via selector circuit 116. Selector circuit 112 provides a “0” constant to compressor 160, making the device in essence a pass-through device. Thus, for 32-bit multiplies such as the MMUL.L instruction, the compression circuit 160 is effectively bypassed. The output 141 is latched into P3 without compression, and clocked into stage 3 during the third cycle.

In stage 3, during the third cycle, the intermediate product terms represented by the sum/carry lines 163 feed into adder circuit 170. Referring to FIG. 4, in adder circuit 170, its constituent selector circuits 420-424 are controlled to produce their ‘a’ inputs by control signals produced in response to decoding the MMUL.L instruction. This causes the carry-out of each full adder 400-402 to propagate into the subsequent adder. Adder 170 is thereby configured as a single four-stage carry-propagate adder. Thus, a single 64-bit addition operation of the incoming sum and carry lines 163 is performed. By comparison, four independent 16-bit additions operations are performed by adder 170 configured in response to decoding the MMUL.W and MMULFX.W instructions. This configurability of adder 170 for use with 32-bit multiplication permits re-use of the circuitry for different-sized data formats without having to design and incorporate logic customized for each data size.

Finally, in accordance with the MMUL.L instruction, the lower 32 bits of the sum (i.e., sum[31:0]) are produced at the output of the adder 170. The masking out of the upper 32 bits is a modulo down-conversion of the 64-bit sum to a 32-bit quantity.

Recall, that the high order longwords Rm₁ and Rn₁ are concurrently processed in a similar fashion, but are one cycle behind. When processing reaches stage 3 in the fourth cycle, a 64-bit result (Rm₁×Rn₁) is produced by adder circuit 170. The sum is down-converted to a 32-bit result and combined with the 32-bit result (Rm₀×Rn₀) from the third cycle into a packed 64-bit result.

MMULFX.L

This is a packed 32-bit fix-point multiply instruction. Each of the two operands Rm, Rn contains two independent 32-bit words. The result Rd comprises two 32-bit values. Rm:  Rm_(L1), Rm_(L0) Rn:  Rn_(L1), Rn_(L0) Rd:  Rm_(L1) × Rn_(L1), Rm_(L0) × Rn_(L0)

The instructions are executed in the same manner as discussed above for MMUL.L, with the following differences to account for the fixed-point number format of the operands:

Since a 32-bit×32-bit multiplication results in a 64-bit quantity, the result of each multiplication is down converted to 32 bits with saturation. The down-conversion involves retaining only the most significant 32 bits of the 64-bit result.

As with MMUL.L, the 32-bit multiplication is reduced to 16-bit multiplies per Eqn. 3. Consequently, overflow detection is needed for each 16-bit operation in multiply circuit 120-126 of stage 1. Thus, with reference to FIG. 3, detection logic 130 determines when both of its inputs are −1. When that occurs, selector circuit 330 produces its ‘a’ inputs. Since saturation generator outputs (1−2⁻³²) for MMULFX.L, the sum and carry lines, c₀ and s₀, will respectively be set to “0” and (1−2⁻³²), or vice-versa. This happens for the other sum and carry lines, s₁/c₁, s₂/c₂, s₃/c₃. In this manner, the overflow condition is detected for the intermediate product terms shown in Eqn. 3. Processing then proceeds to stage 3.

In stage 3, overflow detection logic 180 and 186 provide another determination of whether saturation is needed, since the four intermediate product terms may overflow when summed together. Saturation value generator 182 is controlled to produce 1−2⁻³² for MMULFX.L. When saturation is required, as determined by logic 180 and 186, selector circuits 118 and 119 will produce the ‘a’ inputs to output the saturation value rather than the output of adder 170.

MMULLO.WL

MMULHI.WL

These are packed 16-bit, full-width multiply instructions. Each instruction operates either on the low (“LO”) two words or on the high (“HI”) two words of the operands Rm, Rn. The result operand Rd comprises the two 32-bit product terms. These operations preserve the full 32-bit results of the multiplication. $\begin{matrix} {{{Rm}\text{:}\quad {Rm}_{w3}},{Rm}_{w2},{Rm}_{w1},{Rm}_{w0}} & \quad \\ {{{Rn}\text{:}\quad {Rn}_{w3}},{Rn}_{w2},{Rn}_{w1},{Rn}_{w0}} & \quad \\ {{{Rd}\text{:}\quad {Rm}_{w1} \times {Rn}_{w1}},{{Rm}_{w0} \times {Rn}_{w0}}} & \left( {{MMULLO}.{WL}} \right) \\ {{{Rd}\text{:}\quad {Rm}_{w3} \times {Rn}_{w3}},{{Rm}_{w2} \times {Rn}_{w2}}} & \left( {{MULLHI}.{WL}} \right) \end{matrix}$

With respect to FIG. 1, decoding of these instructions will produce appropriate control signals (not shown) to output the contents of Rm to the src1 data lines and the contents of Rn to the src2 data lines. The data is latched into P1 and clocked into selector circuit 110. Selector circuit 110 is controlled to provide the following output of x and y lines:

x₃=src1[63-48](Rm_(w3)), x₂=src1[47-32](Rm_(w2)), x₁=src1[31-16](Rm_(w1)), x₀=src1[15-0](Rm_(w0))

y₃=src2[63-48](Rn_(w3)), y₂=src2[47-32](Rn_(w2)), y₁=src2[31-16](Rn_(w1)), y₀=src2[15-0](Rn_(w0))

The x and y lines feed into their respective multiplier circuits 120-126. Sum/carry outputs s₃/c₃, s₂/c₂, s₁/c₁, s₀/c₀, are produced at the outputs of multipliers 120-126 and latched into P2. For the purposes of the MMULLO.WL and MMULHI.WL instructions, only the path through circuit 154 is relevant, though the sum/carry pairs in stage 2 feed into transpose circuits 152, 154, and 156.

Transpose circuit 154 is activated by control signals which are produced in response to decoding MMULLO.WL and MMULHI.WL. For MMULLO.WL, transpose circuit 154 is operated so that only the s₁/c₁ and s₀/c₀ sum/carry lines are selected and packed into 64-bit output lines 155. The s₁/c₁ line pair represents the product Rm_(w1)×Rn_(w1), while lines s₀/c₀ represent the product Rm_(w0)×Rn_(w0). For MMULHI.WL, transpose circuit 154 is operated so that only the s₃/c₃ and s₂/c₂ sum/carry lines are selected and packed into the 64-bit output lines 155. The s₃/c₃ line pair represents the product Rm_(w3)×Rn_(w3), while lines s₂/c₂ represent the product Rm_(w2)×Rn_(w2). Selector circuits 114 and 116 cooperate to feed output 155 into compression circuit 160. Selector circuit 112 feeds constant “0” into compression circuit 160. As explained above this bypasses compression circuit 160, thereby latching output 155 directly to P3 without compression.

In stage 3, the sum/carry lines 163 feed into adder circuit 170. Referring to FIG. 4, adder circuit 170 is configured as a four-stage carry-propagate adder by control signals produced in response to decoding the MMULO.WL and MMULHI.WL instructions. Thus, selector circuits 420-424 produce their ‘a’ inputs. This causes the carry-out of each full adder 400-402 to propagate into the subsequent adder. It is noted that only two full adders need to be cascaded, since the product from stage 2 is a 32-bit quantity. The incoming sum and carry lines 163 are combined to produce the final result. For MMULHI.WL, the resulting 32-bit sum is placed in the upper 32 bits of the output of adder 170, whereas for MMULLO.WL the 32-bit sum is placed in the lower 32 bits of the output of the adder.

MMACFX.WL

MMACNFX.WL

These are packed fixed-point, 16-bit, full-width multiply instructions combined with an accumulator (Rd). These instructions operate on only the low order two words of the operands Rm, Rn. The product is summed with (MMACFX.WL) or subtracted from (MMACNFX.WL) the third operand Rd. The final result goes into Rd (denoted here as Rd′). $\begin{matrix} {{{Rm}\text{:}\quad {Rm}_{w1}},{Rm}_{w0}} & \quad \\ {{{Rn}\text{:}\quad {Rn}_{w1}},{Rn}_{w0}} & \quad \\ {{{Rd}\text{:}\quad {Rd}_{L1}},{Rd}_{l0}} & \left( {{incoming}\quad {Rd}} \right) \\ {{{{Rd}^{\quad \prime}\text{:}\quad {Rd}_{L1}} + {{Rm}_{w1} \times {Rn}_{w1}}},{{Rd}_{L0} + {{Rm}_{w0} \times {Rn}_{w0}}}} & \left( {{MMACFX}.{WL}} \right) \\ {{{{{Rd}\quad}^{\prime}\text{:}\quad {Rd}_{L1}} - {{Rm}_{w1} \times {Rn}_{w1}}},{{Rd}_{L0} - {{Rm}_{w0} \times {Rn}_{w0}}}} & \left( {{MMACNFX}.{WL}} \right) \end{matrix}$

These instructions execute in a manner similar to MMULLO.WL with the following differences. In stage 1, overflow detection and saturation is performed in a manner similar to the MMULFX.W instruction. The output from stage 1 feeds into transpose circuits 152, 154, and 156 of stage 2. However, for the MMACFX.WL and MMACNFX.WL instructions, circuit 154 is relevant. Circuit 154 selects the s₁/c₁ and s₀/c₀ sum/carry lines and packs them into 64-bit output lines 155. The output is coupled to compression circuit 160 through selector circuits 114 and 116. The input lines 117 contain s₁/c₁ which represent the product Rm_(w1)×Rn_(w1), and s₀/c₀ which represent the product Rm_(w0)×Rn_(w0).

Selector circuit 112 produces its ‘a’ input which is the src3 line. Control signals corresponding to the MMACFX.WL and MMACNFX.WL instructions will provide data communication with the general purpose register from register file 102 specified by operand Rd. The output of selector circuit 112 feeds into compression circuit 160. Compression circuit 160 adds s₁/c₁ to the upper half of Rd and adds s₀/c₀ to the lower part of Rd. The result proceeds into stage 3 through the P3 latch. Note that since each half of Rd is a fixed point number, the multiplication results of Rm and Rn must be left-shifted by 1 to align their respective fixed points with that of the accumulator.

With respect to FIGS. 1 and 4, the outputs 163 from P3 feed into adder circuit 170. Selector circuits 420 and 424 are controlled to produce their respective ‘a’ inputs, while selector circuit 422 produces its ‘b’ input. This isolates the adders 400 and 401 from 402 and 403 to create two independent cascade adders. Thus, full adders 400 and 401 are cascaded to provide a 32-bit sum namely, Rd_(L0)+Rm_(w0)×Rn_(w0), and full adders 402 and 403 are cascaded to provide another 32-bit sum namely, Rd_(L1)+Rm_(w1)×Rn_(w1). Both of the independent addition operations occur simultaneously. In addition, overflow detection via logic 180 and 186 is provided, outputting (1−2⁻¹⁵) from saturation generator 182 if overflow is predicted.

With respect to MMACNFX.WL, the additional circuitry in multiplication units 120-126 schematically illustrated in FIG. 5 is activated by control signals CTL1 produced in response to decoding the instruction. Recall that asserting CTL1 results in multiplication of x₀ by −y₀. This is the effect desired for MMACNFX.WL. Summing R_(d) with −(x₀×y₀) provides the desired effect of subtracting from R_(d).

MSHLL(R)D.W(L)

MSHARD.W(L)

MSHALDS.W(L)

These are left (right) shifts of packed 16-bit (32-bit) data. The first operand Rm contains four (two) independent 16-bit (32-bit) values. Each is shifted by the same amount as specified in Rn. The result is placed in Rd. $\begin{matrix} {{{Rm}\text{:}\quad {Rm}_{w3}},{Rm}_{w2},{Rm}_{w1},{Rm}_{w0}} & \left( {16\text{-}{bit}} \right) \\ {{{Rm}\text{:}\quad {Rm}_{L1}},{Rm}_{L0}} & \left( {32\text{-}{bit}} \right) \\ {{Rn}\text{:}\quad n} & \left( {{shift}\quad {amount}} \right) \\ {{{Rd}\text{:}\quad {Rm}_{w3}{\operatorname{<<}n}},{{Rm}_{w2}{\operatorname{<<}n}},{{Rm}_{w1}{\operatorname{<<}n}},{{Rm}_{w0}{\operatorname{<<}n}}} & \left( {{{left}\quad {shift}},{16\text{-}{bit}}} \right) \\ {{{{Rd}\text{:}\quad {Rm}_{w3}}\operatorname{>>}n},{{Rm}_{w2}\operatorname{>>}n},{{Rm}_{w1}\operatorname{>>}n},{{Rm}_{w0}\operatorname{>>}n}} & \left( {{{right}\quad {shift}},{16\text{-}{bit}}} \right) \\ {{{Rd}\text{:}\quad {Rm}_{L1}{\operatorname{<<}n}},{{Rm}_{L0}{\operatorname{<<}n}}} & \left( {{{left}\quad {shift}},{32\text{-}{bit}}} \right) \\ {{{{Rd}\text{:}\quad {Rm}_{L1}}\operatorname{>>}n},{{Rm}_{L0}\operatorname{>>}n}} & \left( {{{right}\quad {shift}},{32\text{-}{bit}}} \right) \end{matrix}$

The logical shifts MSHLL(R)D.W(L) do not involve saturation. Similarly for arithmetic right shifts MSHARD.W(L), there is no issue with saturation. Right shifts are divide-by-two operations, and so the final value is always smaller than the starting value. However, sign extension must be provided for right shifts. For arithmetic left shifts MSHALDS.W(L), saturation is provided if needed.

Referring to FIG. 7, decoding any of the logical shift instructions MMSHLLD.W, MMSHLRD.W, MMSHLLD.L, or MMSHLRD.L produces control signals which operate bit shifter 702 and matrix 704. The shift amount is contained in the lowest byte in src2. The three lowest bits of src2 (src2 ₂, src2 ₁, src2 ₀) feed into the shift amount input 754. It can be seen that the lowest three bits is the shift amount modulo 8. An appropriate up/down control signal is generated depending on the instruction, and fed into control 752. Consequently, bit shifter 702 will make a bit-level left or a right shift of the src1 input by an amount (0-7 places) specified by the amount input 754. The output of bit shifter 702 feeds into matrix 704. The next three bits in the src2 byte (src2 ₅, src2 ₄, src2 ₃) feed into control input 756 of matrix 704. This control input specifies the number of 8-bit (byte-level) shifts to be performed on its input.

This two-phase arrangement of a bit-level shift followed by a byte-level shift accommodates both 16-bit and 32-bit shifts. For example, consider a shift of 21 bit positions. Input src2 would contain 010101₂ which is 21 base 10. Thus, bit shifter 702 would shift 101₂ bit positions namely, a shift of 5. Matrix 704 would provide an additional 010₂ byte-level shifts namely, a shift of 16 bit positions, for a total shift of 21 bit positions. The output of matrix 704 feeds into the ‘a’ inputs of selector circuits 740. The ‘b’ inputs of selector circuits 740 receive an output from sign generator 708. The selectors are controlled by an output from mask generator 710.

Refer now to FIGS. 7 and 9 for a discussion of the function of sign generator 708 and mask generator 710. Consider the 24-bit register in FIG. 9, which is divided into three 8-bit elements. The discussion which follows applies to the 16-bit and 32-bit data formats of the instructions MMSHLLD.W, MMSHLRD.W, MMSHLLD.L, and MMSHLRD.L. At step (1), the three initial values are: B2=10111001, B1=00011100, B0=11010101. Suppose a 3-bit right shift is desired. Simply shifting the register by three bits would produce the contents shown at step (2). B2 correctly contains 10111; however, B1 contains 00100011 and B0 contains 10011010. B1 and B0 are incorrect because simply shifting the register contents does not take into account the independent aspect of elements B2, B1, and B0. Consequently, bytes B1 and B0 receive ‘spill-over’ bits from the adjacent byte.

In accordance with the invention, mask generator 710 produces the mask pattern shown in (3), which controls selector circuits 740. Further in accordance with the invention, sign generator 708 outputs zeroes on its 64 bitlines which feeds a zero into each of the ‘b’ inputs of selector circuits 740. Thus, where a ‘1’ occurs in the mask pattern, the selector circuit produces its ‘b’ input which is ‘0’. Where a ‘0’ occurs in the mask pattern, the selector circuit produces its ‘a’ input which is the shifted-register content. The bit pattern at the output of selector circuits 740 (shown at step 4 in FIG. 9, for example) represents properly shifted elements for the given data format; i.e., 16-bit, 32-bit, and so on. The mask generator 710 and sign generator 708 cooperate to effectively mask out the spill-over bits from the adjacent elements.

For the instructions MMSHLLD.W, MMSHLRD.W, MMSHLLD.L, and MMSHLRD.L, the sign generator always outputs all ‘0’s. For this reason, the sign generator is more accurately described as an “alternate value” generator since there is no concept of a “sign” for logical shift instructions. The mask generator 710 produces the correct pattern size (e.g., 16-bit, 32-bit) in response to control signals corresponding to these instructions. The pattern itself is created based on the shift amount contained in the src2 byte, which feeds into the mask generator. As can be seen from (3) in FIG. 9, the pattern for right shifts will have a contiguous run of ‘0’s, as many as specified by the shift amount in src2, and left-padded with a contiguous run of ‘1’s to complete the pattern for the appropriate data size. In reference to FIG. 9, the mask pattern for byte B2 shows a run of five contiguous ‘0’s (the shift amount) and a run of three ‘1’s. As can be surmised, the pattern for left shifts will have as many ‘0’s as specified by the shift amount, but right-padded with enough ‘1’s to complete the pattern for the given data size.

Refer now to FIGS. 7 and 10 in reference to the signed shift instructions MSHARD.W and MSHARD.L. Again, consider a 24-bit register organized as three 8-bit elements. At step (1), the three initial values are: B2=10111001, B1=00011100, B0=11010101. Suppose a 3-bit arithmetic right shift is desired. As before, simply shifting the entire contents of the register by three positions would produce the incorrect results shown at step (2) because of the spill-over bits from adjacent bytes. Moreover, bytes B2 and B0 are negative numbers which requires sign extension when right-shifted. FIG. 10 shows B2 and B0 to be positive numbers at (2).

For MSHARD.W and MSHARD.L, mask generator 710 operates in the same manner, outputting the same bit pattern as discussed above in FIG. 9. Sign generator 708, on the other hand, operates differently. As can be seen in FIG. 10, the sign generator output (4) is a pattern of eight ‘1’s corresponding to each of B2 and B0 and a pattern of ‘0’s corresponding to B1. As can be seen, feeding the sign pattern into the ‘b’ inputs of selectors 740 and operating each selector according to the mask pattern not only produces properly shifted outputs for B2, B1, and B0, but also with proper sign-extension.

Referring to FIG. 7, bits src1 ₆₃, Src1 ₄₇, src1 ₃₁, and src1 ₁₅ feed into sign generator 708. These are the sign bits for the 16-bit data format. For the 32-bit data format, the sign bits are src1 ₆₃ and src1 ₃₁. The sign generator outputs patterns of ‘1’s or ‘0’s depending on these sign bits. The length of the pattern is determined by control signals corresponding to the decoded MSHARD.W (16-bit) or MSHARD.L (32-bit) instruction.

Referring to FIG. 7 in connection with the MSHALDS.W and MSHALDS.L instructions, the overflow detector 720 determines from the output of matrix 704 whether the resulting left shift operation produces overflow. Saturation value generator 722 specifies the upper limit used in detector 720 depending on the data size, 2¹⁶−1 (16-bit) or 2³²−1 (32-bit). If an overflow is predicted, then the saturation value is produced by selector circuit 730.

MSHARDS.O

This is an arithmetic right shift instruction on a signed, 64-bit source Rm. The shift amount is specified in Rn. The result is down-converted to a signed, 16-bit value with saturation and then placed in Rd. This instruction is executed in substantially the same manner as the foregoing logical and arithmetic shifts. The sign generator 708 uses src1 ₆₃ as the single sign bit for a 64-bit pattern of all ‘0’s or all ‘1’s. The mask generator 710 operates as discussed above in connection the other shift operations. Overflow detection is provided by detector 720, comparing against an overflow value of 2¹⁶−1.

MCNVS.WB

MCNVS.WUB

These are down-conversion instructions which convert four signed, 16-bit data in each of operands Rm and Rn to 8-bit values. The down-converted data are represented by Rm′ and Rn′. The eight 8-bit results are either signed (MCNVS.WB) or unsigned (MCNVS.WUB) and are placed in Rd. Saturation on the 8-bit results is performed as needed. Rm:  Rm_(w3), Rm_(w2), Rm_(w1), Rm_(w0) Rn:  Rn_(w3), Rn_(w2), Rn_(w1), Rn_(w0) Rd:  Rn_(w3)^(′), Rn_(w2)^(′), Rn_(w1)^(′), Rn_(w0)^(′), Rm_(w3)^(′), Rm_(w2)^(′), Rm_(w1)^(′), Rm_(w0)^(′)

Referring to FIG. 7, src1 and src2 are the operands for the down-conversion. The bit shifter 702 does not participate in the execution of these instructions, passing src1 and src2 unaffected into matrix 704. Matrix 704, on the other hand performs the mapping required to effectuate the down-conversion. In response to control signals associated with either instruction, matrix 704 produces at its output the lower eight bits from each of the four 16-bit groups in each of src1 and src2. The eight bits are packed into the 64-bit output of the matrix. Overflow detection is performed and saturation is provided for each of the eight 8-bit fields.

MCNVS.LW

This is a down-conversion instruction which converts two 32-bit data in each of operands Rm and Rn to 16-bit values. The down-converted data are represented by Rm′ and Rn′. The four signed, 16-bit results are placed in Rd. Saturation on the 16-bit results is performed as needed. Rm:  Rm_(L1), Rm_(L0) Rn:  Rn_(L1), Rn_(L0) Rd:  Rn_(L1)^(′), Rn_(L0)^(′), Rm_(L1)^(′), Rm_(L0)^(′)

This instruction is executed in essentially the same manner as discussed above for MCNVS.WB and MCNVS.WUB, but on 32-bit packed sources, src1 and src2, and producing 16-bit results.

MSHFHI.B

MSHFLO.B

These instructions shuffle (interleave) 8-bit data in either the upper (HI) or lower (LO) halves of operands Rm and Rn and place the result into Rd. $\begin{matrix} {{{Rm}\text{:}\quad {Rm}_{b7}},{Rm}_{b6},{Rm}_{b5},{Rm}_{b4},{Rm}_{b3},{Rm}_{b2},{Rm}_{b1},{Rm}_{b0}} & \quad \\ {{{Rn}\text{:}\quad {Rn}_{b7}},{Rn}_{b6},{Rn}_{b5},{Rn}_{b4},{Rn}_{b3},{Rn}_{b2},{Rn}_{b1},{Rn}_{b0}} & \quad \\ {{{Rd}\text{:}\quad {Rn}_{b7}},{Rm}_{b7},{Rn}_{b6},{Rm}_{b6},{Rn}_{b5},{Rm}_{b5},{Rn}_{b4},{Rm}_{b4}} & \left( {{MSHFHI}.B} \right) \\ {{{Rd}\text{:}\quad {Rn}_{b3}},{Rm}_{b3},{Rn}_{b2},{Rm}_{b2},{Rn}_{b1},{Rm}_{b1},{Rn}_{b0},{Rm}_{b0}} & \left( {{MSHFLO}.B} \right) \end{matrix}$

Referring to FIG. 7, src1 and src2 are the operands for the down-conversion. The bit shifter 702 does not participate in the execution of these instructions, passing src1 and src2 unaffected into matrix 704. Matrix 704, on the other hand performs the mapping required to effectuate the interleave. In response to control signals associated with either instruction, matrix 704 interleaves, at its output, the four bytes in each of the lower (MSHFLO.B) or upper (MSHFHI.B) half of each of src1 and src2. The output of matrix 704 then passes through to output 730.

MSHFHI.W

MSHFLO.W

These instructions shuffle (interleave) 16-bit data in either the upper (HI) or lower (LO) halves of operands Rm and Rn and place the result into Rd. $\begin{matrix} {{{Rm}\text{:}\quad {Rm}_{w3}},{Rm}_{w2},{Rm}_{w1},{Rm}_{w0}} & \quad \\ {{{Rn}\text{:}\quad {Rn}_{w3}},{Rn}_{w2},{Rn}_{w1},{Rn}_{w0}} & \quad \\ {{{Rd}\text{:}\quad {Rn}_{w3}},{Rm}_{w3},{Rn}_{w2},{Rm}_{w2}} & \left( {{MSHFHI}.W} \right) \\ {{{Rd}\text{:}\quad {Rn}_{w1}},{Rm}_{w1},{Rn}_{w0},{Rm}_{w0}} & \left( {{MSHFLO}.W} \right) \end{matrix}$

These instructions are executed in essentially the same manner as discussed above for MSHFHI(LO).B, but on the two 16-bit words in each of the upper (lower) half of each of src1 and src2.

MSHFHI.L

MSHFLO.L

These instructions shuffle (interleave) 32-bit data in either the upper (HI) or lower (LO) halves of operands Rm and Rn and place the result into Rd. $\begin{matrix} {{{Rm}\text{:}\quad {Rm}_{L1}},{Rm}_{L0}} & \quad \\ {{{Rn}\text{:}\quad {Rn}_{L1}},{Rn}_{L0}} & \quad \\ {{{Rd}\text{:}\quad {Rn}_{L1}},{Rm}_{L1}} & \left( {{MSHFHI}.L} \right) \\ {{{Rd}\text{:}\quad {Rn}_{L0}},{Rm}_{L0}} & \left( {{MSHFLO}.L} \right) \end{matrix}$

These instructions are executed in essentially the same manner as discussed above for MSHFHI(LO).B and MSHFHI(LO).W, but on the 32-bit long word in each of the upper (lower) half of each of src1 and src2.

MPERM.W

This instruction permutes the order of four packed 16-bit data in source operand Rm in accordance with the permutation specified in the control operand Rn. The result goes into result operand Rd. For each of the four 16-bit fields in the result operand, a 2-bit identifier in the control operand determines which 16-bit field from the source operand is copied into that result field. In one embodiment, the lowest eight bits of src2 contain the four 2-bit identifiers. Thus, if src1 comprises four 16-bit fields src1 _(w3), src1 _(w2), src1 _(w1), and src1 _(w0), then ${{src2}\text{:}\quad \underset{\_}{10}11\underset{\_}{00}01_{2}\quad {results}\quad {in}\quad {src3}\text{:}\quad {src1}_{w2}},{src1}_{w3},{src1}_{w0},{src1}_{w1},{{src2}\text{:}\quad \underset{\_}{00}10\underset{\_}{11}01_{2}\quad {results}\quad {in}\quad {src3}\text{:}\quad {src1}_{w0}},{src1}_{w2},{src1}_{w3},{src1}_{w1},{{src2}\text{:}\quad \underset{\_}{11}10\underset{\_}{00}11_{2}\quad {results}\quad {in}\quad {src3}\text{:}\quad {src1}_{w3}},{src1}_{w2},{src1}_{w0},{src1}_{w3},\quad {{and}\quad {so}\quad {{on}.}}$

The last example illustrates that a 16-bit field in the source can be replicated multiple times in the destination.

Referring now to FIG. 7, bit shifter 702 does not participate in MPERM.W and so src1 and src2 pass through the bit shifter unaltered and into matrix 704. The id bits in src2 feed into control input 756 of matrix 704. Control signals produced in response to decoding the MPERM instruction feed into matrix 704. Based on the id bits, matrix 704 produces at its output the specified permutation.

FIG. 11 shows the selection that occurs for MPERM. The 64 bitlines of incoming src1 feed into each of selector circuits 1103-1100. More specifically, each selector comprises four 16-bit inputs. Each of the four 16-bit fields of src1 feeds into a corresponding input. The src2 id bits feed into the select inputs of the selectors. Bits 1,0 control selector 1100, bits 3,2 control selector 1101, bits 5,4 control selector 1102, and bits 7,6 control selector 1103. Each selector output corresponds to one of the 16-bit result fields, indicated in FIG. 11 by its corresponding bit positions. Each selector 1103-1100 can therefore produce any of the four 16-bit fields of src1 to any of the four 16-bit fields of src3. These lines are ultimately combined into a single 64-bit output for the MPERM instruction.

MEXTRm-MEXTR7

These instructions extract 8 bytes across two concatenated registers Rm and Rn, offset from the right by 1-7 bytes. The extracted bytes are placed in Rd.

Rm, Rn: Rm_(b7), Rm_(b6), Rm_(b5), Rm_(b4), Rm_(b3), Rm_(b2), Rm_(b1), Rm_(b0), Rn_(b7), Rn_(b6), Rn_(b5), Rn_(b4), Rn_(b3), Rn_(b2), Rn_(b1), Rn_(b0) $\begin{matrix} {{{Rd}\text{:}\quad {Rm}_{b0}},{Rn}_{b7},{Rn}_{b6},{Rn}_{b5},{Rn}_{b4},{Rn}_{b3},{Rn}_{b2},{Rn}_{b1},} & ({MEXTR1}) \\ {{{Rd}\text{:}\quad {Rm}_{b1}},{Rm}_{b0},{Rn}_{b7},{Rn}_{b6},{Rn}_{b5},{Rn}_{b4},{Rn}_{b3},{Rn}_{b2}} & ({MEXTR2}) \\ {{{Rd}\text{:}\quad {Rm}_{b2}},{Rm}_{b1},{Rm}_{b0},{Rn}_{b7},{Rn}_{b6},{Rn}_{b5},{Rn}_{b4},{Rn}_{b3}} & ({MEXTR3}) \\ {{{Rd}\text{:}\quad {Rm}_{b3}},{Rm}_{b2},{Rm}_{b1},{Rm}_{b0},{Rn}_{b7},{Rn}_{b6},{Rn}_{b5},{Rn}_{b4}} & ({MEXTR4}) \\ {{{Rd}\text{:}\quad {Rm}_{b4}},{Rm}_{b3},{Rm}_{b2},{Rm}_{b1},{Rm}_{b0},{Rn}_{b7},{Rn}_{b6},{Rn}_{b5}} & ({MEXTR5}) \\ {{{Rd}\text{:}\quad {Rm}_{b5}},{Rm}_{b4},{Rm}_{b3},{Rm}_{b2},{Rm}_{b1},{Rm}_{b0},{Rn}_{b7},{Rn}_{b6}} & ({MEXTR6}) \\ {{{Rd}\text{:}\quad {Rm}_{b6}},{Rm}_{b5},{Rm}_{b4},{Rm}_{b3},{Rm}_{b2},{Rm}_{b1},{Rm}_{b0},{Rn}_{b7}} & ({MEXTR7}) \end{matrix}$

Referring to FIG. 7, Rm feeds into src1 and Rn feeds into src2. Bit shifter 702 takes no action on src1 and src2, passing them unaltered to matrix 704. Matrix 704 selects the appropriate number of contiguous bytes from src1 and produces them at corresponding positions in the high order portion of its output. Matrix 704 then selects the appropriate number of contiguous bytes from src2 and produces them at corresponding positions in the low order portion of its output. Control signals corresponding to each of the MEXTR* instructions specify how many bytes in each of src1 and src2 are selected.

MCMV

This instruction performs a conditional bitwise copy of bits from operand Rm into corresponding bit positions in destination Rd based on the bit setting of the corresponding bit in mask Rn. Rm:  Rm₆₃, Rm₆₂, …  Rm₁, Rm₀ Rd:  Rd_(n) ← Rm_(n)  if  Rn_(n)  is  set

Referring to the logic shown in FIG. 8, operand register Rm feeds into src1 and mask register Rn feeds into src2. Destination register Rd also feeds into the logic as src3. Each corresponding pair of bits in src1 and src3 is coupled respectively to the ‘a’ and ‘b’ inputs of a selector circuit 801-863. Each bit in src2 controls a selector circuit.

In operation, each selector circuit 801-863 will produce its ‘a’ input namely, src1 _(n), if the corresponding bit in src2 namely, bit position n, is in a first logic state. Similarly, input ‘b’ is produced namely, src3 _(n) if the bit in bit position n of src2 is in a second logic state. The outputs of the selector circuits 801-863 are combined to form the 64-bit output 880.

Thus, bits from src1 and src3 are conditionally copied to output 880 depending on the logic state of the correspondingly positioned bits in src2. The output 880 is fed back into destination register Rd. Consequently, this has the effect of providing an instruction which conditionally moves bits from a source register Rm into a destination register Rd based on the contents of a mask register Rn.

MSAD

This function performs the sum-of-differences operation on the eight bytes contained in Rm and Rn. The result is summed into Rd. This operation is represented by the following: ${Rd} = {{Rd} + {\sum\limits_{i = 0}^{7}\quad {{{{Rm}_{i} - {Rn}_{i}}}.}}}$

Referring to FIG. 6, operands Rm and Rn feed into src1 and src2 respectively. For the MSAD instruction, selector 110 produces the following 16-bit mapping of src1 and src2 to the 16-bit x and y data lines: $\underset{\_}{16\text{-}{bit}\quad {mapping}}$ $\begin{matrix} \left. {{src1}\left\lbrack {63\text{:}48} \right\rbrack}\Rightarrow x_{3} \right. & \left. {{src2}\left\lbrack {63\text{:}48} \right\rbrack}\Rightarrow y_{3} \right. \\ \left. {{src1}\left\lbrack {47\text{:}32} \right\rbrack}\Rightarrow x_{2} \right. & \left. {{src2}\left\lbrack {47\text{:}32} \right\rbrack}\Rightarrow y_{2} \right. \\ \left. {{src1}\left\lbrack {31\text{:}16} \right\rbrack}\Rightarrow x_{1} \right. & \left. {{src2}\left\lbrack {31\text{:}16} \right\rbrack}\Rightarrow y_{1} \right. \\ \left. {{src1}\left\lbrack {15\text{:}0} \right\rbrack}\Rightarrow x_{0} \right. & \left. {{src2}\left\lbrack {15\text{:}0} \right\rbrack}\Rightarrow y_{0} \right. \end{matrix}$

However, for the MSAD instruction, src1 and src2 each comprise eight 8-bit data elements. Consequently, as shown in FIG. 6, each of the 16-bit x_(n) and y_(n) data lines are further divided into 8-bit lines. This produces the 8-bit data elements in src1 and src2 for this instruction.

Each 8-bit line pair x/y feeds into one of subtraction units 601-608. As discussed above in connection with FIG. 6, each subtraction unit produces the absolute value of the difference between its inputs. The outputs of the subtractors 601-608 are selected by selector circuit 660, rather than the multiplication results of circuits 120-126, and latched into P2 for processing in stage 2.

Referring to FIG. 1, the subtractor outputs are packed by transpose circuit 152 into a pair of 64-bit sum and carry lines 153. Selector circuits 114 and 116 feed lines 153 into compression circuit 160. For the MSAD instruction, operand Rd is coupled to src3, which is picked up by selector circuit 112 and fed into compressor 160. The compression circuit combines its inputs to produce output 161, which is fed to stage 3 via the P3 latches.

In stage 3, adder circuit 170 produces the final sum. It's 32-bit outputs are combined by selector circuits 118 and 119 to produce the desired 64-bit sum of absolute differences output combined with Rd. Referring to FIG. 4, adder circuit 170 is configured by control signals corresponding to the MSAD instruction to operate as a single 4-stage carry-propagate adder. Thus, selector circuits 420-424 are controlled to produce their ‘a’ inputs. This causes the carry-out of each full adder 400-402 to propagate into the subsequent adder. As a result 64-bit addition of the incoming sum and carry lines 163 is performed. 

What is claimed is:
 1. In a RISC-based computer processing core having a general purpose register file, a method of shifting packed data of M N-bit elements comprising steps of: receiving an instruction, the instruction specifying a shift amount and a shift direction; and decoding the instruction to produce control signals; in response to the control signals: selecting one of the general purpose registers; bit-level shifting the data contained therein by a first amount based on the shift amount and by at most seven bit positions to produce a bit-shifted datum; re-ordering the bits of the bit-shifted datum to produce an intermediate result representative of a byte-level shifting of the bit-shifted datum by a second amount based on the shift amount; producing a mask based on the shift amount; and for each bit in the intermediate result, either producing the bit or producing a preselected bit value based on the mask to form a final result.
 2. The method of claim 1 wherein the preselected bit value is logic ‘0’.
 3. The method of claim 1 further including feeding each bit of the intermediate result into one input of a 2:1 selector, the other inputs of the selectors receiving a logic ‘0’; feeding each bit of the mask into a select control input of each of the selectors.
 4. The method of claim 1 wherein the first amount is the shift amount modulo
 8. 5. The method of claim 4 further including reading out a sign bit from each of said data and wherein the preselected value is either a logic ‘0’ or a logic ‘1’ based on the sign bits.
 6. The method of claim 4 further including feeding each bit of the intermediate result into one input of a 2:1 selector, the other inputs of the selectors receiving a logic value based on the sign bits; feeding each bit of the mask into a select control input of each of the selectors.
 7. The processing core of claim 1 wherein M is 4 and N is
 16. 8. The processing core of claim 1 wherein M is 2 and N is
 32. 9. A processing core having circuitry for shifting bits of packed N-bit data by a shift amount, the circuitry comprising: an input for providing a packed N-bit datum, comprising M N-bit elements; shift circuitry having an input to receive the packed datum and effective for shifting the M×N bits of the packed datum by the shift amount to produce a shifted output, the shift circuitry comprising a bit shifter for shifting the packed datum by an amount up to seven bit positions to produce a first result and a matrix operable to re-order at least some of the bits in the first result in any order to produce the shifted output; mask generation logic to produce a mask, the bit-pattern of the mask based on the value of N and the shift amount; an alternate logic value generator for producing M×N bit values; and selector logic effective for producing, for each bit in the shifted output, either that bit or one of the M×N bit values based the mask bits.
 10. The processing core of claim 9 wherein the bit-pattern of the mask comprises M groups of N bits each, each group having a contiguous run of ones and a contiguous run of zeroes, either the run of ones or the run of zeroes being equal to the shift amount.
 11. The processing core of claim 9 wherein the selector logic includes a plurality of 2:1 selectors, each having a first input coupled to receive one of the bits in the shifted output and a second input coupled to receive one of the M×N bit values, each selector having an select input coupled to one of the mask bits.
 12. The processing core of claim 9 wherein the shift circuitry includes a bit shift unit having and input effective for receiving a packed N-bit datum, and a byte shift unit coupled to receive the output of the bit shift unit.
 13. The processing core of claim 9 further including a data path from the sign-bit position of each of the M N-bit data coupled to the alternate logic value generator, the M×N bit values being based on the sign-bits.
 14. The processing core of claim 13 wherein the M×N bit values comprises a pattern of M N-bit groups, each group having a contiguous run of a first logic value equal to the shift amount and a contiguous run of a second logic value equal to the difference between N and the shift amount, the second logic value being based on one of the sign bits.
 15. The processing core of claim 9 wherein M is 4 and N is
 16. 16. The processing core of claim 9 wherein M is 2 and N is
 32. 17. A processing core comprising: bit shifting logic in data communication with the register file, the register file effective for providing the contents of two or three registers; byte shifting logic in data communication with a first output of the bit shifting logic; a plurality of 2:1 selectors, each having a first input coupled to an output of the byte shifting logic; a sign generator in data communication with a second output of the bit shifting logic, the sign generator having an output coupled to a second input of the selector; and a mask generator having outputs coupled to the select inputs of the selectors, the byte-shifting logic configured to receive the first output and to output at least some of the bits comprising the first output in any order, to produce the output of the byte-shifting logic.
 18. The processing core of claim 17 wherein the bit shifting logic, byte shifting logic, sign generator, and the mask generator are responsive to the decoding of a shift instruction.
 19. The processing core of claim 18 wherein the shift instruction is one of MMSHLLD.W, MMSHLRD.W, MMSHLLD.L, MMSHLRD.L, MSHARD.W, and MSHARD.L, wherein MMSHLLD.W is a logical left shift of a packed 16-bit datum, wherein MMSHLRD.W is a logical right shift of a packed 16-bit datum, wherein MMSHLLD.L is a logical left shift of a packed 32-bit datum, wherein MMSHLRD.W is a logical right shift of a packed 16-bit datum wherein MMSHARD.W is an arithmetic right shift of a packed 16-bit datum, and wherein MMSHARD.L is an arithmetic right shift of a packed 16-bit datum.
 20. The processing core of claim 18 wherein the byte shifting logic is further responsive to the decoding of one of the MCNVS.WB, MCNVS.WUB, and MCNVS.LW instructions, wherein MCNVS.WB is a conversion of signed 16-bit data to signed 8-bit values, wherein MCNVS.WUB is a conversion of signed 16-bit data to unsigned 8-bit values, and wherein MCNVS.LW is a conversion of 32-bit data to signed 16-bit values.
 21. The processing core of claim 20 wherein the byte shifting logic is further responsive to the decoding of one of the MSHFHI.B, MSHFLO.B, MSHFHI.W, MSHFLO.W, MSHFHI.L, MSHFLO.L instructions, wherein MSHFHI.B is an interleave of 8-bit data stored in an upper portion of a first operand associated with the instruction with 8-bit data stored in an upper portion of a second operand associated with the instruction, wherein MSHFLO.B is an interleave of 8-bit data stored in a lower portion of a first operand associated with the instruction with 8-bit data stored in a lower portion of a second operand associated with the instruction, wherein MSHFHI.W is an interleave of 16-bit data stored in an upper portion of a first operand associated with the instruction with 16-bit data stored in an upper portion of a second operand associated with the instruction, wherein MSHFLO.W is an interleave of 16-bit data stored in a lower portion of a first operand associated with the instruction with 16-bit data stored in a lower portion of a second operand associated with the instruction, wherein MSHFHI.L is an interleave of 32-bit data stored in an upper portion of a first operand associated with the instruction with 32-bit data stored in an upper portion of a second operand associated with the instruction, and wherein MSHFLO.L is an interleave of 32-bit data stored in a lower portion of a first operand associated with the instruction with 32-bit data stored in a lower portion of a second operand associated with the instruction.
 22. The processing core of claim 21 wherein the byte shifting logic is further responsive to the decoding of an MPERM.W instruction, wherein MPERM.W permutes an ordering of 16-bit data stored in a first operand associated with the instruction according to data stored in a second operand associated with the instruction.
 23. The processing core of claim 22 wherein the byte shifting logic is further responsive to the decoding of one of the MEXTR1, MEXTR2, MEXTR3, MEXTR4, MEXTR5, MEXTR6, and MEXTR7 instructions, wherein MEXTRn extracts eight bytes of data from two concatenated operands associated with the instruction, the eight bytes being offset from the right side of the concatenated operands by “n” bytes. 